Generalized convexity: CP3 and boundaries of convex sets

نویسندگان

  • Longin Jan Latecki
  • Azriel Rosenfeld
  • Ruth Silverman
چکیده

A set S is convex if for every pair of points P, Q~S, the line segment PQ is contained in S, This definition can be generalized in various ways. One class of generalizations makes use of k-tuples, rather than pairs, of points-for example, Valentine's property P3: For every triple of points P, Q, R of S, at least one of the line segments PQ, QR, or RP is contained in S. It can be shown that if a set has property P3, it is a union of at most three convex sets. In this paper we study a property closely related to, but weaker than, P3' We say that S has property CP3 ("collinear P3") if P3 holds for all collinear triples of points of S. We prove that a closed curve is the boundary of a convex set, and a simple arc is part of the boundary of a convex set, iff they have property CP a. This result appears to be the first simple characterization of the boundaries of convex sets; it solves a problem studied over 30 years ago by Menger and Valentine. Convexity Convex arcs Convex curves Generalized convexity Boundaries l. INTRODUCTION A set S is convex if for every pair of points P, QeS, the line segment PQ is contained in S. This definition can be generalized in various ways. For example, (1) S is called starshapedfrom Po E S if PoQ is contained in S for all QeS; thus S is convex if it is starshaped from all of its points. As another example, (2) S is called ortho-convex if PQ is contained is S for all P, Q ~ S such that PQ is horizontal or vertical. One class of generalizations of convexity, due to Valentine, 13) makes use of triples (or k-tuples), rather than pairs, of points. A set satisfies Valentine's property P3 if for every triple of points P, Q, R of S, at least one of the line segments PQ, QR, or RP is contained in S. For example, a polygonal arc consisting of two non-collinear line segments (Fig. 1) is not convex, but is easily seen to have property P3. (Note that the three-segment polygonal arc in Fig. lb does not even have property P3-) It can be shown that if a set has property P3, it is a union of at most three convex sets. In this paper …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexity and Geodesic Metric Spaces

In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Salient Points of Q-Convex Sets

The Q-convexity is a kind of convexity in the discrete plane. This notion has practically the same properties as the usual convexity: an intersection of two Qconvex sets is Q-convex, and the salient points can be defined like the extremal points. Moreover a Q-convex set is characterized by its salient point. The salient points can be generalized to any finite subset of Z2.

متن کامل

Convex structures via convex $L$-subgroups of an $L$-ordered group

In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1995